Minimization and Minimal Realization in Span(Graph)
نویسندگان
چکیده
The context of this article is the program to study the bicategory of spans of graphs as an algebra of processes, with applications to concurrency theory. The objective here is to study functorial aspects of reachability, minimization and minimal realization. The compositionality of minimization has application to model-checking.
منابع مشابه
Minimisation and minimal realisation in Span(Graph)
The context of this article is the program to study the bicategory of spans of graphs as an algebra of processes, with applications to concurrency theory. The objective here is to study functorial aspects of reachability, minimization and minimal realization. The compositionality of minimization has application to model-checking.
متن کاملCost-minimal trees in directed acyclic graphs
A number of examples are given where one seeks a minimal-cost tree to span a given subset of the nodes of a connected, directed, acyclic graph (we call such a graph monotonic). Some of these examples require an al~orithm to transform the problem into the form of a minimization problem in a monotonic graph.; this algorithm is also given. Finally, an implicit enumeration algorithm is presented fo...
متن کاملExtremal optimal realizations
An optimal realization of a metric d on a set X is a weighted graph G = (V, E, w) such that X ⊆ V , dG(x, y) = d(x, y) for all x ∈ X, and ∑ e∈E w(e) is minimal. In this paper, we consider the conjecture that any finite metric (X, d) has some optimal realization obtainable as a subgraph of its tight span. For an extremal optimal realization G, defined as an optimal realizations for which the num...
متن کاملMinimal Realization in Bicategories of Automata
The context of this article is the program to develop monoidal bicategories with a feedback operation as an algebra of processes with applications to concurrency theory The objective here is to study reachability minimization and minimal realization in these bicategories In this set ting the automata are cells in contrast with previous studies where they appeared as objects As a consequence we ...
متن کاملDetermining the order of minimal realization of descriptor systems without use of the Weierstrass canonical form
A common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the Weierstrass canonical form. The Weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. The present ...
متن کامل